Diagonal forms and zero-sum (mod 2) bipartite Ramsey numbers
نویسنده
چکیده
Let G be a subgraph of a complete bipartite graph Kn,n. Let N(G) be a 0-1 incidence matrix with edges of Kn,n against images of G under the automorphism group of Kn,n. A diagonal form of N(G) is found for every G, and whether the row space of N(G) over Zp contains the vector of all 1’s is determined. This re-proves Caro and Yuster’s results on zero-sum bipartite Ramsey numbers [3], and provides necessary and sufficient conditions for the existence of a signed bipartite graph design.
منابع مشابه
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems
This thesis focuses mainly on linear algebraic aspects of combinatorics. Let Nt(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M. Wilson and the author find the general formula for the Smith normal form or diagonal form of Nt(H) for all simple graphs H and for a very general class of t-uniform hypergraphs H. As a continu...
متن کاملThe Characterization of Zero - Sum ( mod 2 ) Bipartite
Let G be a bipartite graph, with k j e(G). The zero-sum bipartite Ramsey number B(G; Z k) is the smallest integer t such that in every Z k-coloring of the edges of K t;t , there is a zero-sum mod k copy of G in K t;t. In this paper we give the rst proof which determines B(G; Z 2) for all possible bipartite graphs G. In fact, we prove a much more general result from which B(G; Z 2) can be deduce...
متن کاملThe characterization of zero-sum (mod 2) bipartite Ramsey numbers
Let G be a bipartite graph, with k | e(G). The zero-sum bipartite Ramsey number B(G,Zk) is the smallest integer t such that in every Zk-coloring of the edges of Kt,t, there is a zero-sum mod k copy of G in Kt,t. In this paper we give the first proof which determines B(G,Z2) for all possible bipartite graphs G. In fact, we prove a much more general result from which B(G,Z2) can be deduced: Let G...
متن کاملA Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers
THEOREM. Let G be a graph on n vertices and an euen number of edges. Then the zero-sum (mod 2) Ramsey numbers are given by {i +2 R(G, ~2) = + 1 +t ifG=Kn, n =0,1(mod4) if all the degrees in G are odd otherwise. 0 (mod 2) This settles several problems raised mainly by Noga Alon, Arie Bialostocki, and Yehuda Roditty.
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 124 شماره
صفحات -
تاریخ انتشار 2014